Synthesis of Labelled Transition Systems into Equal-Conflict Petri Nets
نویسندگان
چکیده
This paper introduces properties preset-equality for equalconflict Petri nets and enabling-equivalence for their reachability graphs. It explores the relation between these properties and shows its use for synthesis of equal-conflict Petri nets from labelled transition systems.
منابع مشابه
Synthesis of Petri Nets with Localities
Automated synthesis from behavioural specifications is an attractive way of constructing computational systems. In this paper, we look at a specific instance of this approach which aims at constructing GALS (globally asynchronous locally synchronous) systems. GALS systems are represented by Petri nets with localities, each locality defining a set of co-located actions, and specifications are gi...
متن کاملk-Bounded Petri Net Synthesis from Modal Transition Systems
We present a goal-oriented algorithm that can synthesise k-bounded Petri nets (k ∈ N+) from hyper modal transition systems (hMTS), an extension of labelled transition systems with optional and required behaviour. The algorithm builds a potential reachability graph of a Petri net from scratch, extending it stepwise with required behaviour from the given MTS and overapproximating the result to a ...
متن کاملAnalysis of Petri Nets and Transition Systems
Labelled transition systems are frequently employed in order to display the state space of a given Petri net and to analyse its behavioural properties. Conversely, by region theory [1], a Petri net may be synthesisable from a given labelled transition system. Such a net is then correct “by design”. However, a transition system may be extremely (even infinitely) large, causing synthesis algorith...
متن کاملReachability Graphs of Two-Transition Petri Nets
The reachability graph of a Petri net is a labelled transition system that can have a very complex structure. A characterisation of reachability graphs of Petri nets with only two transitions gives insight into typical structures that also might occur with arbitrarily large nets. An important means for such a characterisation is region theory, which allows to draw conclusions from cycles occurr...
متن کاملUsing maximality-based labelled transition system as a model for petri nets
This work deals with the specification and the verification of concurrent systems. Our goal is to exploit an implementable model, namely the maximality -based labelled transition system, which permits expressing true-concurrency in a natural way without splitting actions on their start and end events. To do this, we give an operational semantics to build maximality-based labelled transition sys...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017